Imaginary Cubes and Their Puzzles

نویسنده

  • Hideki Tsuiki
چکیده

Imaginary cubes are three dimensional objects which have square silhouette projections in three orthogonal ways just as a cube has. In this paper, we study imaginary cubes and present assembly puzzles based on them. We show that there are 16 equivalence classes of minimal convex imaginary cubes, among whose representatives are a hexagonal bipyramid imaginary cube and a triangular antiprism imaginary cube. Our main puzzle is to put three of the former and six of the latter pieces into a cube-box with an edge length of twice the size of the original cube. Solutions of this puzzle are based on remarkable properties of these two imaginary cubes, in particular, the possibility of tiling 3D Euclidean space.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Imaginary Hypercubes

Imaginary cubes are three-dimensional objects that have square projections in three orthogonal ways, just like a cube has. In this paper, we introduce higherdimensional extensions of imaginary cubes and study their properties.

متن کامل

Imaginary Cubes — Objects with Three Square Projection Images — Hideki Tsuiki

An imaginary cube is a three dimensional object which has square projections in three orthogonal directions just as a cube has. In this paper, we study imaginary cubes and present sculptures based on imaginary cubes. We show that there are 16 kinds of minimal convex imaginary cubes. The list of 16 representative minimal convex imaginary cubes contains, as well as a regular tetrahedron and a cub...

متن کامل

خواص متریک و ترکیبیاتی مکعب‌های فیبوناتچی و لوکاس

An n-dimensional hypercube, Q_n, is a graph in which vertices are binary strings of length n where two vertices are adjacent if they differ in exactly one coordinate. Hypercubes and their subgraphs have a lot of applications in different fields of science, specially in computer science. This is the reason why they have been investigated by many authors during the years. Some of their subgraphs ...

متن کامل

Imaginary Coloring

The axiom of choice, a benign matter for the non-logician, puzzles mathematicians. Today, it manifests itself in a strange way: it takes, depending on the axiom’s variants, either two or infinity of colors to resolve a coloring problem. Just as the parallels postulate seemed obvious, the axiom of choice has often been considered true and beyond discussion. The inventor of set theory, Georg Cant...

متن کامل

Finding a Hamiltonian Path in a Cube with Specified Turns is Hard Citation

We prove the NP-completeness of finding a Hamiltonian path in an N ×N ×N cube graph with turns exactly at specified lengths along the path. This result establishes NP-completeness of Snake Cube puzzles: folding a chain of N unit cubes, joined at face centers (usually by a cord passing through all the cubes), into an N ×N ×N cube. Along the way, we prove a universality result that zig-zag chains...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Algorithms

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2012